SELF OPTIMIZING KERNEL WITH HYBRID SCHEDULING ALGORITHM
نویسندگان
چکیده
منابع مشابه
Optimizing Multi-Site Production Planning and Scheduling with a Hybrid Genetic Algorithm
As the economic environment continues to change rapidly, so does the demand placed on industries to meet ever expanding orders. In order to meet this demand, the need to expand is matched by the need to utilize existing facilities, and increase efficiency. As a result, conventional order management programs often no longer suffice. Single-site planning has developed into multi-site planning, le...
متن کاملOptimizing Carpool Scheduling Algorithm through Partition Merging
The rapidly increasing number of vehicles in roads leads to numerous problems in metropolitan areas. Several researchers show that carpooling can be an efficient solution to relieve the pressures caused by large numbers of cars. Previous research on carpools introduces several additional constraints to simplify the problem, but some of them are unreasonable in reality. In this paper, we focus o...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملEASE: Energy-Aware Self-Optimizing DRAM Scheduling
We propose an energy-aware self-optimizing memory controller in which DRAM energy management is integral to the command scheduler. Experiments conducted on a 8-core CMP model show that, for the parallel applications considered, our scheduler reduces memory’s energy-delay squared Et by 18% while delivering a 5% speedup with respect to a state-of-the-art power-aware solution.
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics Signals and Systems
سال: 2013
ISSN: 2231-5969
DOI: 10.47893/ijess.2013.1141